Linear Algebraic Relations among Cardinalities of Sets of Matroid Functions
نویسندگان
چکیده
We introduce a unifying approach for invariants of finite matroids that count mappings to set. The aim this paper is show if the cardinalities with fixed values on restricted set satisfy contraction–deletion rules, then there relation among them can be expressed in terms linear algebra. In way, we study regular chain groups, nowhere-zero flows and tensions graphs, acyclic totally cyclic orientations oriented graphs.
منابع مشابه
Comparing Cardinalities of Sets
Students often have motivational difficulty in accepting the definitions of comparing cardinalities of sets. The key to the application of the concepts lies in the so called SchröderBernstein theorem, the proof of which is often avoided due to its difficulty level. In this short article, we discuss the remarkable results around this theorem and finally give a very simple proof. On the way, we a...
متن کاملAlgebraic Relations among Solutions of Linear Differential Equations
Using power series methods, Harris and Sibuya [3, 4] recently showed that if A: is an ordinary differential field of characteristic zero and y 5¿ 0 is an element of a differential extension of fc such that y and l/y satisfy linear differential equations with coefficients in fc, then y'¡y is algebraic over fc. Using differential galois theory, we generalize this and characterize those polynomial...
متن کاملSets, relations, functions
When we start doing serious logic, we very quickly find ourselves wanting to talk about sets. ‘Domains of quantification’ are sets, the ‘extensions of predicates’ are subsets of the domain of quantification. And so forth. But note that this does not immediately entangle us with the heavy duty notion of set that it is the business of hard-core mathematical theories like Zermelo-Fraenkel Set Theo...
متن کاملCollections, Cardinalities, and Relations
Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make such logics more useful in verification this paper extends them with the ability to compute direct and inverse relation and function images. We establish decidability and complexity bounds for the extended logics.
متن کامل1 Sets , Functions , and Relations
1.1 Sets, Valuations, and Boolean Algebras We shall usually work with finite sets. If A is a finite set, let |A| be the number of elements in A. The function | · | satisfies the functional equation |A ∪ B| + |A ∩ B| = |A| + |B|. The function | · | is one of many functions measuring the “size” of a set. Let v be a function from a collection C of sets to an algebraic structure A (such as an Abeli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11112570